Why Maps Are Not Propositional ∗
نویسندگان
چکیده
Why Maps Are Not Propositional∗ A number of philosophers and logicians have argued for the conclusion that maps are logically tractable modes of representation by analyzing them in propositional terms. But in doing so, they have often left what they mean by ‘propositional’ undefined or unjustified. I argue that propositions are characterized by a structure that is digital, universal, asymmetrical, and recursive. There is little positive evidence that maps exhibit these features. Instead, we can better explain their functional structure by taking seriously the observation that maps arrange their constituent elements in a non-hierarchical, holistic structure. This is compatible with the more basic claim advanced by defenders of a propositional analysis: that (many) maps do have a formal semantics and logic.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملCombining Paraconsistency and Relevance
A (propositional) logic L is paraconsistent with respect to a negation connective if P; P 6`L Q in case P and Q are two distinct atomic variables. Intuitively (and practically) the logic(s) we use should be paraconsistent (with respect to any unary connective!) on the ground of relevance: why should a \contradiction" concerning P imply something completely unrelated? Nevertheless, the most know...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملRewriting for Fitch Style Natural Deductions
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ordinary mathematical practice, is given in [Fitch 1952]. We define precisely a CurryHoward interpretation that maps Fitch style deductions to simply typed terms, and we analyze why it is not an isomorphism. We then descri...
متن کاملDL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE
We prove that the model checking and the satisfiability problem of both Dynamic Logic of Propositional Assignments DL-PA and Coalition Logic of Propositional Control and Delegation DCL-PC are in PSPACE. We explain why the proof of EXPTIME-hardness of the model checking problem of DL-PA presented in [1, Thm 4] is false. We also explain why the proof of membership in PSPACE of the model checking ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017